New q-ary quantum MDS codes with distances bigger than \(\frac{q}{2}\)
نویسندگان
چکیده
Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there have been constructed only a few q-ary quantum MDS [[n, n−2d+2, d]]q codes with minimum distances d > q 2 for sparse lengths n > q + 1. In the case n = q 2 −1 m where m|q + 1 or m|q − 1 there are complete results. In the case n = q 2 −1 m while m|q − 1 is not a factor of q − 1 or q + 1, there is no q-ary quantum MDS code with d > q 2 has been constructed. In this paper we propose a direct approach to construct Hermitian self-orthogonal codes over Fq2 . Then we give some new q-ary quantum codes in this case. Moreover we present many new q-ary quantum MDS codes with lengths of the form w(q−1) u and minimum distances d > q 2 .
منابع مشابه
Constructing new q-ary quantum MDS codes with distances bigger than q/2 from generator matrices
The construction of quantum error-correcting codes has been an active field of quantum information theory since the publication of [1, 2, 3]. It is becoming more and more difficult to construct some new quantum MDS codes with large minimum distance. In this paper, based on the approach developed in the paper [4], we construct several new classes of quantum MDS codes. The quantum MDS codes exhib...
متن کاملNew quantum MDS codes derived from constacyclic codes
Quantum error-correcting codes play an important role in both quantum communication and quantum computation. It has experienced a great progress since the establishment of the connections between quantum codes and classical codes (see [4]). It was shown that the construction of quantum codes can be reduced to that of classical linear error-correcting codes with certain self-orthogonality proper...
متن کاملOptimal locally repairable codes via elliptic curves
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg [14] first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, q-ary optimal locally repairable codes from subcodes of Reed-Solomon codes giv...
متن کاملOn Near-MDS Elliptic Codes
The Main Conjecture on maximum distance separable (MDS) codes states that, except for some special cases, the maximum length of a q-ary linear MDS code of is q+1. This conjecture does not hold true for near maximum distance separable codes because of the existence of q-ary near-MDS elliptic codes having length bigger than q+1. An interesting related question is whether a near-MDS elliptic code ...
متن کاملSome Hermitian Dual Containing BCH Codes and New Quantum Codes
Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information Processing
دوره 15 شماره
صفحات -
تاریخ انتشار 2016